Stationary and Mobile Target Detection using Mobile Wireless Sensor Networks

In this work, we study the target detection and tracking problem in mobile sensor networks, where the performance metrics of interest are probability of detection and tracking coverage, when the target can be stationary or mobile and its duration is finite. We propose a physical coverage-based mobility model, where the mobile sensor nodes move such that the overlap between the covered areas by different mobile nodes is small. It is shown that for stationary target scenario the proposed mobility model can achieve a desired detection probability with a significantly lower number of mobile nodes especially when the detection requirements are highly stringent. Similarly, when the target is mobile the coverage-based mobility model produces a consistently higher detection probability compared to other models under investigation.Comment: 7 pages, 12 figures, appeared in INFOCOM 201

Networking Behavior in Thin Film and Nanostructure Growth Dynamics

Thin film coatings have been essential in development of several micro and nano-scale devices. To realize thin film coatings various deposition techniques are employed, each yielding surface morphologies with different characteristics of interest. Therefore, understanding and control of the surface growth is of great interest. In this paper, we devise a novel network-based modeling of the growth dynamics of such thin films and nano-structures. We specifically map dynamic steps taking place during the growth to components (e.g., nodes, links) of a corresponding network. We present initial results showing that this network-based modeling approach to the growth dynamics can simplify our understanding of the fundamental physical dynamics such as shadowing and re-emission effects

Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks

Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the churn caused by the ad-hoc nodes joining or leaving the network. Preserving the structure becomes more prohibitive due to the distributed and potentially uncooperative nature of such networks, as in the peer-to-peer (P2P) networks. Thus, most practical solutions involve unstructured approaches while attempting to maintain the structure at various levels of protocol stack. The primary focus of this paper is to investigate construction and maintenance of scale-free topologies in a distributed manner without requiring global topology information at the time when nodes join or leave. We consider the uncooperative behavior of peers by limiting the number of neighbors to a pre-defined hard cutoff value (i.e., no peer is a major hub), and the ad-hoc behavior of peers by rewiring the neighbors of nodes leaving the network. We also investigate the effect of these hard cutoffs and rewiring of ad-hoc nodes on the P2P search efficiency.Comment: 10 pages, 6 figures, 43 references. Proceedings of The 8th IEEE International Conference on Peer-to-Peer Computing 2008 (IEEE P2P 2008), Aachen, German

Aflatoxin Regulations in a Network of Global Maize Trade

Worldwide, food supplies often contain unavoidable contaminants, many of which adversely affect health and hence are subject to regulations of maximum tolerable levels in food. These regulations differ from nation to nation, and may affect patterns of food trade. We soughtto determine whether there is an association between nations' food safety regulations and global food trade patterns, with implications for public health and policymaking. We developed a network model of maize trade around the world. From maize import/export data for 217 nations from 2000-2009, we calculated basic statistics on volumes of trade; then examined how regulations of aflatoxin, a common contaminant of maize, are similar or different between pairs of nations engaging in significant amounts of maize trade. Globally, market segregation appears to occur among clusters of nations. The United States is at the center of one cluster; European countries make up another cluster with hardly any maize trade with the US; and Argentina, Brazil, and China export maize all over the world. Pairs of nations trading large amounts of maize have very similar aflatoxin regulations: nations with strict standards tend to trade maize with each other, while nations with more relaxed standards tend to trade maize with each other. Rarely among the top pairs of maize-trading nations do total aflatoxin standards (standards based on the sum of the levels of aflatoxins B1, B2, G1, and G2) differ by more than 5 μg/kg. These results suggest that, globally, separate maize trading communities emerge; and nations tend to trade with other nations that have very similar food safety standards. © 2012 Wu, Guclu

Social contact networks and mixing among students in K-12 schools in Pittsburgh, PA

Students attending schools play an important role in the transmission of influenza. In this study, we present a social network analysis of contacts among 1,828 students in eight different schools in urban and suburban areas in and near Pittsburgh, Pennsylvania, United States of America, including elementary, elementary-middle, middle, and high schools. We collected social contact information of students who wore wireless sensor devices that regularly recorded other devices if they are within a distance of 3 meters. We analyzed these networks to identify patterns of proximal student interactions in different classes and grades, to describe community structure within the schools, and to assess the impact of the physical environment of schools on proximal contacts. In the elementary and middle schools, we observed a high number of intra-grade and intra-classroom contacts and a relatively low number of inter-grade contacts. However, in high schools, contact networks were well connected and mixed across grades. High modularity of lower grades suggests that assumptions of homogeneous mixing in epidemic models may be inappropriate; whereas lower modularity in high schools suggests that homogenous mixing assumptions may be more acceptable in these settings. The results suggest that interventions targeting subsets of classrooms may work better in elementary schools than high schools. Our work presents quantitative measures of age-specific, school-based contacts that can be used as the basis for constructing models of the transmission of infections in schools

Scale-free overlay topologies with hard cutoffs for unstructured peer-to-peer networks

In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. Topological characteristics have profound impact on the efficiency of search on such unstructured P2P networks as well as other networks. It has been well-known that search on small-world topologies of N nodes can be as efficient as O(ln N), while scale-free (power-law) topologies offer even better search efficiencies like as good as O(ln lnN) for a range of degree distribution exponents. However, generation and maintenance of such scale-free topologies are hard to realize in a distributed and potentially uncooperative environments as in the P2P networks. A key limitation of scale-free topologies is the high load (i.e. high degree) on very few number of hub nodes. In a typical unstructured P2P network, peers are not willing to maintain high degrees/loads as they may not want to store large number of entries for construction of the overlay topology. So, to achieve fairness and practicality among all peers, hard cutoffs on the number of entries are imposed by the individual peers, which limits scale-freeness of the overall topology. Thus, efficiency of the flooding search reduces as the size of the hard cutoff does. We investigate construction of scale-free topologies with hard cutoffs (i.e. there are not any major hubs) and effect of these hard cutoffs on the search efficiency. Interestingly, we observe that the efficiency of normalized flooding and random walk search algorithms increases as the hard cutoff decreases. I

Global maize trade network emphasizing top exporters.

<p>The circle sizes are loosely proportional to the amount of maize exported. Each line represents export/import amount greater than 1 million metric tons from 2000–2009 [Wu and Guclu, unpublished data].</p